A Groebner bases technique to compute distance and weight distribution of cyclic codes and their shortened codes∗
نویسنده
چکیده
Using Gröbner basis techniques, we can exhibit a method to get distance and weight distribution of both cyclic codes and shortened cyclic codes, extending and improving previous work on the distance of cyclic codes.
منابع مشابه
Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes
Cyclic, negacyclic and constacyclic codes are part of a larger class of codes called polycyclic codes; namely, those codes which can be viewed as ideals of a factor ring of a polynomial ring. The structure of the ambient ring of polycyclic codes over GR(p,m) and generating sets for its ideals are considered. It is shown that these generating sets are strong Groebner bases. A method for finding ...
متن کاملOn the structure of Hermitian codes1
Let X,,, denote the Hermitian curve xm+’ = ym + y over the field F,,,z. Let Q be the single point at infinity, and let D be the sum of the other rn3 points of X,,, rational over F,,,z, each with multiplicity 1. X,,, has a cyclic group of automorphisms of order m2 1, which induces automorphisms of each of the the one-point algebraic geometric Goppa codes &(D,uQ) and their duals. As a result, the...
متن کاملComputing the distance distribution of systematic non-linear codes
The most important families of non-linear codes are systematic. We provide a Gröbner bases technique to compute the distance distribution of systematic nonlinear codes.
متن کاملInformation sets in abelian codes: defining sets and Groebner basis
In [BS2] we introduced a technique to construct information sets for every semisimple abelian code by means of its defining set. This construction is a non trivial generalization of that given by H. Imai [Im] in the case of binary two-dimensional cyclic (TDC) codes. On the other hand, S. Sakata [Sak] showed a method for constructing information sets for binary TDC codes based on the computation...
متن کاملcondition on one - dimensional attracting sets of the simplest skew product of interval maps
In the theory of codes based on the Hamming metric, three classes of codes are well known, viz. cyclic codes, shortened cyclic codes and pseudocyclic codes. The important result is that a class of linear shortened cyclic codes coincides with a class of linear pseudocyclic codes [1]. There are no similar results in the theory of rank-metric based codes. In this paper, we generalize the notion of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003